A Bidding-based Grid Resource Selection Algorithm using Single Reservation Mechanism
نویسندگان
چکیده
The selection of resources that best fitting tasks in grid environments is an essential and critical factor to system performance. Current resource selection methods apply traditional mechanisms for the process of task allocation to resources, which cause performance problems. This paper proposes a resource selection algorithm in bidding based grid environment to minimize the total time for task completion in effective and efficient way. To avoid unexpected completion time arises when using non-reserved bidding process due to the competition between grid clients on resources; our algorithm proposes the single reservation mechanism to reserve the best resource for the task as a commitment and hence guarantees the task completion time will be as expected. This algorithm uses single reservation mechanism to reserve the best resource for the task. Unlike traditional reserved algorithms this algorithm reserves only the best resource and hence it allows other resources to participate in other bidding processes. We believe the proposed algorithm can select the most fitting resources for tasks execution and achieve a good performance in terms of effectiveness and efficiency.
منابع مشابه
Optimization of the Lyapunov Based Nonlinear Controller Parameters in a Single-Phase Grid-Connected Inverter
In this paper, optimization of the backstepping controller parameters in a grid-connected single-phase inverter is studied using Imperialist competitive algorithm (ICA), Genetic Algorithm (GA) and Particle swarm optimization (PSO) algorithm. The controller is developed for the system based on state-space averaged model. By selection of a suitable Lyapunov function, stability of the proposed con...
متن کاملDynamic resource selection heuristics for a non-reserved bidding-based Grid environment
A Grid system is comprised of large sets of heterogeneous and geographically distributed resources that are aggregated as a virtual computing platform for executing large-scale scientific applications. As the number of resources in Grids increases rapidly, selecting appropriate resources for jobs has become a crucial issue. To avoid single point of failure and server overload problems, bidding ...
متن کاملA time-to-live based reservation algorithm on fully decentralized resource discovery in Grid computing
We present an alternative algorithm of fully decentralized resource discovery in Grid computing, which enables the sharing, selection, and aggregation of a wide variety of geographically distributed computational resources. Our algorithm is based on a simply unicast request transmission that can be easily implemented. The addition of a reservation algorithm can find more available matching reso...
متن کاملDynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملLoad Balancing in Partner-Based Scheduling Algorithm for Grid Workflow
Automated advance reservation has the potential to ensure a good scheduling solution in computational Grids. To improve global throughput of Grid system and enhance resource utilization, workload has to be distributed among the resources of the Grid evenly. This paper discusses the problem of load distribution and resource utilization in heterogeneous Grids in advance reservation environment. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011